| 翻訳と辞書 |
| folded cube graph ： ウィキペディア英語版 |
folded cube graph
In graph theory, a folded cube graph is an undirected graph formed from a hypercube graph by adding to it a perfect matching that connects ''opposite'' pairs of hypercube vertices.
==Construction==
The folded cube graph of order ''k'' (containing 2''k'' − 1 vertices) may be formed by adding edges between opposite pairs of vertices in a hypercube graph of order ''k'' − 1. (In a hypercube with 2''n'' vertices, a pair of vertices are ''opposite'' if the shortest path between them has length ''n''.) It can, equivalently, be formed from a hypercube graph (also) of order ''k'', which has twice as many vertices, by identifying together (or contracting) every opposite pair of vertices.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「folded cube graph」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|